Resource allocation for query processing in grid systems: A survey

Grid systems are very useful platforms for distributed databases, especially in some situations in which the scale of data sources and user requests is very high. However, the main characteristics of grid systems such as dynamicity, large size and heterogeneity, bring new problems to the query processing domain such as resource discovery and resource allocation. In this paper, we provide a survey related to resource allocation methods for query processing In data grid systems. We provide a classification for existing studies considering their approaches to the resource allocation problem. We provide a synthesis of the studies and propose evaluations and comparisons for the different classes of studies. ©2012 CRL Publishing Ltd

Grid resource discovery based on web services

The size of grid systems has increased substantially in the last decades. Resource discovery in grid systems is a fundamental task which provides searching and locating necessary resources for a given process. Various different approaches are proposed in literature for this problem. Grid resource discovery using web services is an important approach which has resulted in many tools to become de facto standards of today's grid resource management. In this paper, we propose a survey of recent grid resource discovery studies based on web services. We provide synthesis, analysis and evaluation of these studies by classification. We also give a comparative study of different classes proposed

Örgü sistemlerde sorgu işlemesi için kaynak taraması ve ataması

Örgü sistemleri geniş ölçekli hesaplama kabiliyetleri ve yüksek erişilebilirlikleri sebebiyle günümüzün ilgi çeken araştırma konularından biri haline gelmiştir. Bu sebeple birçok güncel araştırma alanı örgü sistemlerinin sunduğu olanaklardan faydalanmaktadır. Dağıtık sorgu işleme, mevcut altyapısını koşut ve dağıtık sistemlerden örgü sistemlere taşımak amacıyla yüksek miktarda araştırmalar yapılan alanlardan birisidir. Bu tezde, örgü sistemler üzerinde sorgu işlemesi için kaynak taraması ve kaynak ataması konuları üzerinde odaklanılmaktadır. Bunun için, öncelikle örgü sistemleri üzerinde sorgu işlemesi için öz-kararlı ilinge denetimi ve kapsayan ağaç tabanlı kaynak taraması algoritmaları önerilmektedir. Daha sonra tek birleştirme işletmenli sorguların örgü sistemleri üzerinde işletilmesi için, küçültülmüş aday düğüm arama uzayı ve aday düğümlerin veri kaynaklarına olan yakınlıklarını kullanan kaynak atama algoritmaları önerilmektedir. Önerilen bu kaynak atama algoritması, çoklu birleştirme işletmenli sorgularda kullanılabilmek üzere ilerletilmiş ve daha sonra da hataya dayanıklı olacak şekilde geliştirilmiştir. Bu tezin, bilime çift taraflı olarak katkı koyması planlanmıştır. İlk olarak, örgü sistemlerinin özellikleri göz önüne alınarak kaynak tarama algoritmaları önerilmektedir. Örgü sistemlerdeki ölçeklenebilirlik ve devingenlik problemleri, örgü üzerinde oluşturulan öz kararlı ilinge denetimi algoritmaları ile çözülmektedir. Sistemdeki kaynakların türdeş olmamasından kaynaklanan problemler ise kapsayan ağaç tabanlı kaynak tarama algoritmaları ile çözümlenmektedir. Örgü sistemlerinin özellikleri gözetilerek önerilen kaynak atama algoritmaları ise tezin ikinci katkısını oluşturmaktadır. Bu aşamada, ölçeklenebilirlik problemleri aday düğüm arama uzayının boyutunun küçültülmesi ile çözülmektedir. Sorgunun işletilmesi sırasında iletişim maliyetlerinin azaltılması amacıyla veri kaynaklarına yakın olan düğümlerin sorgu işlemesine katılması sağlanmaktadır. Son olarak örgü sistemindeki düğümlerin devingenliklerinden kaynaklanan problemlerin çözümü için hataya dayanıklı kaynak atama algoritması önerilmektedir

A dominating set based communication architecture for distributed applications in mobile Ad hoc networks

Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2007Includes bibliographical references (leaves: 72-76)Text in English; Abstract: Turkish and Englishx, 93 leavesIn this thesis, we aim to design and implement algorithms in a distributed environment in order to solve clustering, backbone formation and efficient routing problems for mobile ad hoc networks(MANET)s. Our first goal is to find a connected dominating set (CDS), then construct clusters using the clusterhead information and extend this approach to multi-level clusters. We propose a new Connected Dominating Set based clustering algorithm for clustering in MANETs. Our algorithm is based on Wu and Li's algorithm, however we provide significant modifications and heuristics such as considering the degrees of the nodes during marking process. We also extend our algorithm in order to generate a hierarchy of clusters. Our second goal is to implement a flooding based routing mechanism on top of CDS based clusters. We propose a two level flooding mechanism by using the CDS members as the gateways of the clusters. We describe the algorithms, analyze their time and message complexities and measure their performance in the simulation environments

A hierarchical connected dominating set based clustering algorithm for mobile ad hoc networks

15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, MASCOTS'07; Istanbul; Turkey; 24 October 2007 through 26 October 2007We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connected Dominating Set Based Clustering (CDSC) Algorithm [1]. We extended the levels of the CDS to two levels and improved functionality at each level by providing additional rules to make sure that every node belongs to a single cluster. In the first level of the algorithm, the elements of the CDS are formed, based on CDSC Algorithm heuristics with improved functionality. The second level of the algorithm is executed among the CDS elements to find the second level CDS where each element belonging to the set represents a group of CDS elements, therefore a group of clusters. We show that this approach is more scalable and simpler to implement than a single level algorithm and that it also provides more balanced two level clusters due to its distributed nature. We also show that the number of levels of the algorithm can be extended to more than two layers providing more populated clusters, therefore providing a level of cluster and group membership structure within the MANET. This hierarchical groups can be used for different application needs at each level such as multi-cast communication or security purposes in MANETs

A maximum degree self-stabilizing spanning tree algorithm

25th International Symposium on Computer and Information Sciences, ISCIS 2010; London; United Kingdom; 22 September 2010 through 24 September 2010Spanning trees are fundamental topological structures in distributed environments which ease many applications that require frequent communication between nodes. In this paper, we examine and compare two spanning tree construction algorithms which rely on classical and self stabilization approach. Then, we propose a new self-stabilizing spanning tree construction algorithm which uses maximum degree heuristic while choosing the root node. We show experimentally that our new algorithm provides smaller tree diameters than the two existing approaches with favorable run-times. © 2011 Springer Science+Business Media B.V

Merging Clustering Algorithms in Mobile Ad Hoc Networks

2nd International Conference on Distributed Computing and Internet Technology, ICDCIT 2005; Bhubaneswar; India; 22 December 2005 through 24 December 2005Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We first look at minimum spanning tree(MST) based algorithms and then propose a new algorithm for clustering in MANETs. The algorithm we propose merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities

Resource allocation for query processing in grid systems: A survey

Grid systems are very useful platforms for distributed databases, especially in some situations in which the scale of data sources and user requests is very high. However, the main characteristics of grid systems such as dynamicity, large size and heterogeneity, bring new problems to the query processing domain such as resource discovery and resource allocation. In this paper, we provide a survey related to resource allocation methods for query processing In data grid systems. We provide a classification for existing studies considering their approaches to the resource allocation problem. We provide a synthesis of the studies and propose evaluations and comparisons for the different classes of studies. ©2012 CRL Publishing Ltd

Resource discovery in grid systems: A survey

Resource Discovery (RD) is one of the key issues in successful Grid systems. Yet, new methodologies for RD are constantly researched owing to the dynamicity, heterogeneity and large-scale characteristics of Grids. Recently, synergy and convergence between Grid, Agent and Peer-to-Peer (P2P) systems were pointed out clearly. This paper provides a survey and a qualitative comparison of the most promising approaches (P2P techniques and agent systems) for RD. Viability of Grid systems relies mainly on efficient integration of P2P techniques and mobile agent (MA) systems to bring scaling and decentralised control properties to Grids

Grid resource discovery based on web services

The size of grid systems has increased substantially in the last decades. Resource discovery in grid systems is a fundamental task which provides searching and locating necessary resources for a given process. Various different approaches are proposed in literature for this problem. Grid resource discovery using web services is an important approach which has resulted in many tools to become de facto standards of today's grid resource management. In this paper, we propose a survey of recent grid resource discovery studies based on web services. We provide synthesis, analysis and evaluation of these studies by classification. We also give a comparative study of different classes proposed